全文获取类型
收费全文 | 12753篇 |
免费 | 1413篇 |
国内免费 | 850篇 |
专业分类
化学 | 426篇 |
晶体学 | 46篇 |
力学 | 4307篇 |
综合类 | 170篇 |
数学 | 7457篇 |
物理学 | 2610篇 |
出版年
2024年 | 7篇 |
2023年 | 123篇 |
2022年 | 144篇 |
2021年 | 202篇 |
2020年 | 355篇 |
2019年 | 306篇 |
2018年 | 333篇 |
2017年 | 380篇 |
2016年 | 434篇 |
2015年 | 302篇 |
2014年 | 546篇 |
2013年 | 1178篇 |
2012年 | 596篇 |
2011年 | 686篇 |
2010年 | 604篇 |
2009年 | 701篇 |
2008年 | 666篇 |
2007年 | 777篇 |
2006年 | 709篇 |
2005年 | 704篇 |
2004年 | 618篇 |
2003年 | 602篇 |
2002年 | 542篇 |
2001年 | 495篇 |
2000年 | 471篇 |
1999年 | 455篇 |
1998年 | 407篇 |
1997年 | 250篇 |
1996年 | 221篇 |
1995年 | 194篇 |
1994年 | 174篇 |
1993年 | 118篇 |
1992年 | 149篇 |
1991年 | 128篇 |
1990年 | 86篇 |
1989年 | 50篇 |
1988年 | 37篇 |
1987年 | 43篇 |
1986年 | 33篇 |
1985年 | 47篇 |
1984年 | 32篇 |
1983年 | 32篇 |
1982年 | 17篇 |
1981年 | 18篇 |
1980年 | 6篇 |
1979年 | 8篇 |
1978年 | 4篇 |
1977年 | 7篇 |
1974年 | 3篇 |
1957年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 78 毫秒
71.
Masanobu Haraguchi David F. P. Pile Toshihiro Okamoto Masuo Fukui Dmitri K. Gramotnev 《Optical Review》2006,13(4):228-230
We have numerically shown the existence of coupled wedge plasmons (CWPs) which propagates along a nano gap of a twin metal
wedge. The CWPs are formed by wedge plasmons which can interact with each other. The dispersion relations of the wavenumber,
propagation distance, and beam area of CWPs, are described and show that the characteristics of CWPs are similar to those
of wedge plasmons and of gap plasmons. We also propose a new plasmon waveguide composed of twin metal wedges with a nano gap. 相似文献
72.
High even order generalizations of the traditional upwind method are introduced to solve second order ODE-BVPs without recasting
the problem as a first order system. Both theoretical analysis and numerical comparison with central difference schemes of
the same order show that these new methods may avoid typical oscillations and achieve high accuracy. Singular perturbation
problems are taken into account to emphasize the main features of the proposed methods.
AMS subject classification (2000) 65L10, 65L12, 65L50 相似文献
73.
Boniface Nkemzi 《Mathematical Methods in the Applied Sciences》2006,29(9):1053-1080
This paper is concerned with the structure of the singular and regular parts of the solution of time‐harmonic Maxwell's equations in polygonal plane domains and their effective numerical treatment. The asymptotic behaviour of the solution near corner points of the domain is studied by means of discrete Fourier transformation and it is proved that the solution of the boundary value problem does not belong locally to H2 when the boundary of the domain has non‐acute angles. A splitting of the solution into a regular part belonging to the space H2, and an explicitly described singular part is presented. For the numerical treatment of the boundary value problem, we propose a finite element discretization which combines local mesh grading and the singular field methods and derive a priori error estimates that show optimal convergence as known for the classical finite element method for problems with regular solutions. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
74.
We construct a new family of cyclic difference sets with parameters ((3
d
– 1)/2, (3
d – 1 – 1)/2, (3
d – 2 – 1)/2) for each odd d. The difference sets are constructed with certain maps that form Jacobi sums. These new difference sets are similar to Maschietti's hyperoval difference sets, of the Segre type, in characteristic two. We conclude by calculating the 3-ranks of the new difference sets. 相似文献
75.
Eckhard Steffen 《Discrete Mathematics》2004,280(1-3):191-214
Cubic bridgeless graphs with chromatic index four are called uncolorable. We introduce parameters measuring the uncolorability of those graphs and relate them to each other. For k=2,3, let ck be the maximum size of a k-colorable subgraph of a cubic graph G=(V,E). We consider r3=|E|−c3 and
. We show that on one side r3 and r2 bound each other, but on the other side that the difference between them can be arbitrarily large. We also compare them to the oddness ω of G, the smallest possible number of odd circuits in a 2-factor of G. We construct cyclically 5-edge connected cubic graphs where r3 and ω are arbitrarily far apart, and show that for each 1c<2 there is a cubic graph such that ωcr3. For k=2,3, let ζk denote the largest fraction of edges that can be k-colored. We give best possible bounds for these parameters, and relate them to each other. 相似文献
76.
Cao H. P. Chen G. Grechkoseeva M. A. Mazurov V. D. Shi W. J. Vasil'ev A. V. 《Siberian Mathematical Journal》2004,45(6):1031-1035
The spectrum of a finite group is the set of its element orders. A finite group G is said to be recognizable by spectrum, if every finite group with the same spectrum as G is isomorphic to G. The purpose of the paper is to prove that for every natural m the finite simple Chevalley group F
4(2
m
) is recognizable by spectrum. 相似文献
77.
Juan Gonzá lez-Meneses Luis Paris 《Transactions of the American Mathematical Society》2004,356(1):219-243
We show that Vassiliev invariants separate braids on a closed oriented surface, and we exhibit a universal Vassiliev invariant for these braids in terms of chord diagrams labeled by elements of the fundamental group of the surface.
78.
María G. Armentano Ricardo G. Durn 《Numerical Methods for Partial Differential Equations》2003,19(5):653-664
In this article we analyze the effect of mass‐lumping in the linear triangular finite element approximation of second‐order elliptic eigenvalue problems. We prove that the eigenvalue obtained by using mass‐lumping is always below the one obtained with exact integration. For singular eigenfunctions, as those arising in non convex polygons, we prove that the eigenvalue obtained with mass‐lumping is above the exact eigenvalue when the mesh size is small enough. So, we conclude that the use of mass‐lumping is convenient in the singular case. When the eigenfunction is smooth several numerical experiments suggest that the eigenvalue computed with mass‐lumping is below the exact one if the mesh is not too coarse. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 19: 653–664, 2003 相似文献
79.
In this paper, three new direct Mutually Orthogonal Latin Squares (MOLS) constructions are presented for 7 MOLS(24), 7 MOLS(75) and 8 MOLS(36); then using recursive methods, several new constructions for 7 and 8 MOLS are obtained. These reduce the largest value for which 7 MOLS are unknown from 780 to 570, and the largest odd value for which 8 MOLS are unknown from 1935 to 419. © 2003 Wiley Periodicals, Inc. 相似文献
80.